Deadlock properties of queueing networks with finite capacities and multiple routing chains
نویسندگان
چکیده
منابع مشابه
Deadlock properties of queueing networks with finite capacities and multiple routing chains
Blocking in queueing network models with nite capacities can lead to deadlock situations. In this paper, deadlock properties are investigated in queueing networks with multiple routing chains. The necessary and suucient conditions for deadlock-free queueing networks with blocking are provided. An optimization algorithm is presented for nding deadlock-free capacity assignments with the least tot...
متن کاملProperties and Analysis of Queueing Network Models with Finite Capacities
A b s t r a c t Queueing network models with finite capacity queues and blocking are used to represent systems with finite capacity resources and with resource constraints, such as production, communication and computer systems. Various blocking mechanisms have been defined in literature to represent the various behaviours of real systems with limited resources. Queueing networks with finite ca...
متن کاملModelling deadlock in open restricted queueing networks
Open restricted queueing networks give rise to the phenomenon of deadlock, whereby some customers may be unable to ever leave a server due to mutual blocking. This paper explores deadlock in queueing networks with limited queueing capacity, presents a method of detecting deadlock in discrete event simulations, and builds Markov chain models of these deadlocking networks. The three networks for ...
متن کاملOptimal Routing in General Finite Multi-Server Queueing Networks
The design of general finite multi-server queueing networks is a challenging problem that arises in many real-life situations, including computer networks, manufacturing systems, and telecommunication networks. In this paper, we examine the optimal routing problem in arbitrary configured acyclic queueing networks. The performance of the finite queueing network is evaluated with a known approxim...
متن کاملA Simple Throughput Bound for Large Closed Queueing Networks with Finite Capacities
Arbitrary closed exponential queueing networks are examined such as with finite capacities and blocking or dynamic routing. Conditions are provided from which a simple upper bound on the system throughput and an error bound for its accuracy can be concluded. These conditions are illustrated for a Jackson network with finite entrance buffer and overflow station. An explicit error bound for this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 1995
ISSN: 0257-0130,1572-9443
DOI: 10.1007/bf01245327